Solving XpressBees Logistics Problem by Using Exact and Heuristic Method

Abstract Finding the shortest travelling distance based on various situations might assist travelers in making a better selection of route decisions. The main goal this paper is to solve routing problem for company’s fleet vehicle (XpressBees) order find best under constraints such as Signalized Intersections, Vehicle Capacity, Customer Demands, and Time Windows reduce transportation costs by using real data. TSP VRP their variants are common problems logistics companies that handle commodities transportation. In addition, signalised intersections, Highway Capacity Manual used, truck optimization, Product Loading Algorithm used. As result, there algorithms provide solution problem, Branch Bound Penalty Method, Dijikstra’s Algorithm, Dynamic Programming, Clarke Wright savings algorithm Holmes Parker Heuristic. These returns option, which cheapest route.